0.00/0.02	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.10/0.36	% Computer : n021.cluster.edu
0.10/0.36	% Model    : x86_64 x86_64
0.10/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.36	% Memory   : 8046.5625MB
0.10/0.36	% OS       : Linux 6.8.0-71-generic
0.10/0.36	% CPULimit : 1440
0.10/0.36	% WCLimit  : 180
0.10/0.37	% DateTime : Mon Jul 27 11:51:37 UTC 2026
0.10/0.37	% CPUTime  : 
0.10/0.37	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.10/0.41	Running higher-order theorem proving
0.10/0.42	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p
0.10/0.44	% Version: 3.5.1-ho
0.10/0.44	% Preprocessing class: HSSSSMSSMLSNHSN.
0.10/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.44	% Starting new_ho_9 with 900s (5) cores
0.10/0.44	% Starting post_as_ho1 with 180s (1) cores
0.10/0.44	% Starting sh1l with 180s (1) cores
0.10/0.44	% Starting post_as_ho10 with 180s (1) cores
0.10/0.44	% post_as_ho1 with pid 720311 completed with status 0
0.10/0.44	% Result found by post_as_ho1
0.10/0.44	% Preprocessing class: HSSSSMSSMLSNHSN.
0.10/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.44	% Starting new_ho_9 with 900s (5) cores
0.10/0.44	% Starting post_as_ho1 with 180s (1) cores
0.10/0.44	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.10/0.44	% No SInE strategy applied
0.10/0.44	% Search class: HHHPS-FFSF31-SHSSMSNN
0.10/0.44	% partial match(3): HHHNS-FFSF11-SHSSMFNN
0.10/0.44	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.10/0.44	% Starting SubtermCWHack with 17s (1) cores
0.10/0.44	% SubtermCWHack with pid 720314 completed with status 0
0.10/0.44	% Result found by SubtermCWHack
0.10/0.44	% Preprocessing class: HSSSSMSSMLSNHSN.
0.10/0.44	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.10/0.44	% Starting new_ho_9 with 900s (5) cores
0.10/0.44	% Starting post_as_ho1 with 180s (1) cores
0.10/0.44	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.10/0.44	% No SInE strategy applied
0.10/0.44	% Search class: HHHPS-FFSF31-SHSSMSNN
0.10/0.44	% partial match(3): HHHNS-FFSF11-SHSSMFNN
0.10/0.44	% Scheduled 7 strats onto 1 cores with 180 seconds (180 total)
0.10/0.44	% Starting SubtermCWHack with 17s (1) cores
0.10/0.44	% Preprocessing time       : 0.001 s
0.10/0.44	
0.10/0.44	% Proof found!
0.10/0.44	% SZS status Theorem
0.10/0.44	% SZS output start CNFRefutation
0.10/0.44	thf(decl_24, type, fun_composition: ($i > $i) > ($i > $i) > $i > $i).
0.10/0.44	thf(decl_26, type, fun_injective: ($i > $i) > $o).
0.10/0.44	thf(decl_27, type, fun_surjective: ($i > $i) > $o).
0.10/0.44	thf(decl_28, type, fun_bijective: ($i > $i) > $o).
0.10/0.44	thf(decl_31, type, esk1_0: $i > $i).
0.10/0.44	thf(decl_32, type, esk2_0: $i > $i).
0.10/0.44	thf(decl_33, type, esk3_0: $i > $i).
0.10/0.44	thf(decl_34, type, esk4_1: $i > $i).
0.10/0.44	thf(decl_35, type, esk5_1: $i > $i).
0.10/0.44	thf(decl_36, type, esk6_0: $i).
0.10/0.44	thf(decl_37, type, esk7_0: $i).
0.10/0.44	thf(decl_38, type, esk8_0: $i).
0.10/0.44	thf(fun_bijective, axiom, ((fun_bijective)=(^[X1:$i > $i]:((((fun_injective @ X1))&((fun_surjective @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p', fun_bijective)).
0.10/0.44	thf(fun_injective, axiom, ((fun_injective)=(^[X1:$i > $i]:(![X4:$i, X3:$i]:(((((X1 @ X4)=(X1 @ X3)))=>(((X4)=(X3)))))))), file('/export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p', fun_injective)).
0.10/0.44	thf(fun_surjective, axiom, ((fun_surjective)=(^[X1:$i > $i]:(![X3:$i]:(?[X4:$i]:(((X3)=(X1 @ X4))))))), file('/export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p', fun_surjective)).
0.10/0.44	thf(thm, conjecture, ![X1:$i > $i, X5:$i > $i, X8:$i > $i]:(((((fun_injective @ (fun_composition @ (fun_composition @ X1 @ X5) @ X8))&(fun_surjective @ (fun_composition @ (fun_composition @ X5 @ X8) @ X1)))&(fun_surjective @ (fun_composition @ (fun_composition @ X8 @ X1) @ X5)))=>(fun_bijective @ X8))), file('/export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p', thm)).
0.10/0.44	thf(fun_composition, axiom, ((fun_composition)=(^[X1:$i > $i, X5:$i > $i, X4:$i]:(X5 @ (X1 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.Hs7SY1xOmq/E---3.1_720297.p', fun_composition)).
0.10/0.44	thf(c_0_5, plain, ((fun_bijective)=(^[Z0:$i > $i]:((((![X12:$i, X13:$i]:(((((Z0 @ X12)=(Z0 @ X13)))=>(((X12)=(X13)))))))&((![X14:$i]:(?[X15:$i]:(((X14)=(Z0 @ X15)))))))))), inference(fof_simplification,[status(thm)],[fun_bijective])).
0.10/0.44	thf(c_0_6, plain, ((fun_injective)=(^[Z0:$i > $i]:(![X4:$i, X3:$i]:(((((Z0 @ X4)=(Z0 @ X3)))=>(((X4)=(X3)))))))), inference(fof_simplification,[status(thm)],[fun_injective])).
0.10/0.44	thf(c_0_7, plain, ((fun_surjective)=(^[Z0:$i > $i]:(![X3:$i]:(?[X4:$i]:(((X3)=(Z0 @ X4))))))), inference(fof_simplification,[status(thm)],[fun_surjective])).
0.10/0.44	thf(c_0_8, negated_conjecture, ~(![X1:$i > $i, X5:$i > $i, X8:$i > $i]:(((((fun_injective @ (fun_composition @ (fun_composition @ X1 @ X5) @ X8))&(fun_surjective @ (fun_composition @ (fun_composition @ X5 @ X8) @ X1)))&(fun_surjective @ (fun_composition @ (fun_composition @ X8 @ X1) @ X5)))=>(fun_bijective @ X8)))), inference(assume_negation,[status(cth)],[thm])).
0.10/0.45	thf(c_0_9, plain, ((fun_bijective)=(^[Z0:$i > $i]:((((![X12:$i, X13:$i]:(((((Z0 @ X12)=(Z0 @ X13)))=>(((X12)=(X13)))))))&((![X14:$i]:(?[X15:$i]:(((X14)=(Z0 @ X15)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.10/0.45	thf(c_0_10, negated_conjecture, ~(![X1:$i > $i, X5:$i > $i, X8:$i > $i]:((((![X16:$i, X17:$i]:((((fun_composition @ (fun_composition @ X1 @ X5) @ X8 @ X16)=(fun_composition @ (fun_composition @ X1 @ X5) @ X8 @ X17))=>((X16)=(X17))))&![X18:$i]:(?[X19:$i]:(((X18)=(fun_composition @ (fun_composition @ X5 @ X8) @ X1 @ X19)))))&![X20:$i]:(?[X21:$i]:(((X20)=(fun_composition @ (fun_composition @ X8 @ X1) @ X5 @ X21)))))=>(![X22:$i, X23:$i]:((((X8 @ X22)=(X8 @ X23))=>((X22)=(X23))))&![X24:$i]:(?[X25:$i]:(((X24)=(X8 @ X25)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_6]), c_0_7]), c_0_9])).
0.10/0.45	thf(c_0_11, plain, ![X26:$i > $i, X27:$i > $i, X28:$i]:(((fun_composition @ X26 @ X27 @ X28)=(X27 @ (X26 @ X28)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fun_composition])])).
0.10/0.45	thf(c_0_12, negated_conjecture, ![X35:$i, X36:$i, X37:$i, X39:$i, X44:$i]:(((((((fun_composition @ (fun_composition @ esk1_0 @ esk2_0) @ esk3_0 @ X35)!=(fun_composition @ (fun_composition @ esk1_0 @ esk2_0) @ esk3_0 @ X36))|((X35)=(X36)))&((X37)=(fun_composition @ (fun_composition @ esk2_0 @ esk3_0) @ esk1_0 @ (esk4_1 @ X37))))&((X39)=(fun_composition @ (fun_composition @ esk3_0 @ esk1_0) @ esk2_0 @ (esk5_1 @ X39))))&((((esk3_0 @ esk6_0)=(esk3_0 @ esk7_0))|((esk8_0)!=(esk3_0 @ X44)))&(((esk6_0)!=(esk7_0))|((esk8_0)!=(esk3_0 @ X44)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])).
0.10/0.45	thf(c_0_13, plain, ![X29:$i > $i, X30:$i > $i, X31:$i]:(((fun_composition @ X29 @ X30 @ X31)=(X30 @ (X29 @ X31)))), inference(variable_rename,[status(thm)],[c_0_11])).
0.10/0.45	thf(c_0_14, negated_conjecture, ![X3:$i, X4:$i]:((((X3)=(X4))|((fun_composition @ (fun_composition @ esk1_0 @ esk2_0) @ esk3_0 @ X3)!=(fun_composition @ (fun_composition @ esk1_0 @ esk2_0) @ esk3_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.10/0.45	thf(c_0_15, plain, ![X1:$i > $i, X5:$i > $i, X3:$i]:(((fun_composition @ X1 @ X5 @ X3)=(X5 @ (X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.10/0.45	thf(c_0_16, negated_conjecture, ![X3:$i]:(((X3)=(fun_composition @ (fun_composition @ esk3_0 @ esk1_0) @ esk2_0 @ (esk5_1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.10/0.45	thf(c_0_17, negated_conjecture, ![X3:$i]:(((X3)=(fun_composition @ (fun_composition @ esk2_0 @ esk3_0) @ esk1_0 @ (esk4_1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.10/0.45	thf(c_0_18, negated_conjecture, ![X3:$i, X4:$i]:((((X3)=(X4))|((esk3_0 @ (esk2_0 @ (esk1_0 @ X3)))!=(esk3_0 @ (esk2_0 @ (esk1_0 @ X4)))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15]), c_0_15]), c_0_15]), c_0_15])).
0.10/0.45	thf(c_0_19, negated_conjecture, ![X3:$i]:(((esk2_0 @ (esk1_0 @ (esk3_0 @ (esk5_1 @ X3))))=(X3))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_15]), c_0_15])).
0.10/0.45	thf(c_0_20, negated_conjecture, ![X3:$i]:(((esk1_0 @ (esk3_0 @ (esk2_0 @ (esk4_1 @ X3))))=(X3))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_15]), c_0_15])).
0.10/0.45	thf(c_0_21, negated_conjecture, ![X3:$i, X4:$i]:((((X3)=(esk3_0 @ (esk5_1 @ X4)))|((esk3_0 @ (esk2_0 @ (esk1_0 @ X3)))!=(esk3_0 @ X4)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.10/0.45	thf(c_0_22, negated_conjecture, ![X3:$i, X4:$i]:((((X3)=(esk3_0 @ (esk2_0 @ (esk4_1 @ X4))))|((esk3_0 @ (esk2_0 @ (esk1_0 @ X3)))!=(esk3_0 @ (esk2_0 @ X4))))), inference(spm,[status(thm)],[c_0_18, c_0_20])).
0.10/0.45	thf(c_0_23, negated_conjecture, ![X3:$i]:(((esk3_0 @ (esk5_1 @ (esk2_0 @ (esk1_0 @ X3))))=(X3))), inference(er,[status(thm)],[c_0_21])).
0.10/0.45	thf(c_0_24, negated_conjecture, ![X3:$i]:(((esk3_0 @ (esk2_0 @ (esk4_1 @ (esk1_0 @ X3))))=(X3))), inference(er,[status(thm)],[c_0_22])).
0.10/0.45	thf(c_0_25, negated_conjecture, ![X3:$i]:(((esk3_0 @ (esk5_1 @ (esk2_0 @ X3)))=(esk3_0 @ (esk2_0 @ (esk4_1 @ X3))))), inference(spm,[status(thm)],[c_0_23, c_0_20])).
0.10/0.45	thf(c_0_26, negated_conjecture, ![X3:$i]:(((esk3_0 @ (esk2_0 @ (esk4_1 @ (esk4_1 @ (esk1_0 @ (esk3_0 @ (esk2_0 @ (esk1_0 @ X3))))))))=(X3))), inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_24])]), c_0_25])).
0.10/0.45	thf(c_0_27, negated_conjecture, ![X3:$i]:(((esk4_1 @ (esk1_0 @ (esk3_0 @ (esk2_0 @ (esk1_0 @ X3)))))=(esk1_0 @ X3))), inference(spm,[status(thm)],[c_0_20, c_0_26])).
0.10/0.45	thf(c_0_28, negated_conjecture, ![X3:$i]:(((esk4_1 @ (esk1_0 @ (esk3_0 @ (esk2_0 @ X3))))=(X3))), inference(spm,[status(thm)],[c_0_27, c_0_20])).
0.10/0.45	thf(c_0_29, negated_conjecture, ![X3:$i]:((((esk3_0 @ esk6_0)=(esk3_0 @ esk7_0))|((esk8_0)!=(esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.10/0.45	thf(c_0_30, negated_conjecture, ![X3:$i]:(((esk4_1 @ (esk1_0 @ (esk3_0 @ X3)))=(esk1_0 @ (esk3_0 @ (esk5_1 @ X3))))), inference(spm,[status(thm)],[c_0_28, c_0_19])).
0.10/0.45	thf(c_0_31, negated_conjecture, ((esk3_0 @ esk6_0)=(esk3_0 @ esk7_0)), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_23])])).
0.10/0.45	thf(c_0_32, negated_conjecture, ![X3:$i]:((((esk6_0)!=(esk7_0))|((esk8_0)!=(esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.10/0.45	thf(c_0_33, negated_conjecture, ((esk1_0 @ (esk3_0 @ (esk5_1 @ esk6_0)))=(esk1_0 @ (esk3_0 @ (esk5_1 @ esk7_0)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_30])).
0.10/0.45	thf(c_0_34, negated_conjecture, ((esk6_0)!=(esk7_0)), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_23])])).
0.10/0.45	thf(c_0_35, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_33]), c_0_19]), c_0_34]), ['proof']).
0.10/0.45	% SZS output end CNFRefutation
0.10/0.45	% Parsed axioms                        : 17
0.10/0.45	% Removed by relevancy pruning/SinE    : 0
0.10/0.45	% Initial clauses                      : 14
0.10/0.45	% Removed in clause preprocessing      : 8
0.10/0.45	% Initial clauses in saturation        : 6
0.10/0.45	% Processed clauses                    : 18
0.10/0.45	% ...of these trivial                  : 0
0.10/0.45	% ...subsumed                          : 0
0.10/0.45	% ...remaining for further processing  : 18
0.10/0.45	% Other redundant clauses eliminated   : 7
0.10/0.45	% Clauses deleted for lack of memory   : 0
0.10/0.45	% Backward-subsumed                    : 1
0.10/0.45	% Backward-rewritten                   : 4
0.10/0.45	% Generated clauses                    : 55
0.10/0.45	% ...of the previous two non-redundant : 35
0.10/0.45	% ...aggressively subsumed             : 0
0.10/0.45	% Contextual simplify-reflections      : 0
0.10/0.45	% Paramodulations                      : 45
0.10/0.45	% Factorizations                       : 0
0.10/0.45	% NegExts                              : 0
0.10/0.45	% Equation resolutions                 : 10
0.10/0.45	% Disequality decompositions           : 0
0.10/0.45	% Total rewrite steps                  : 48
0.10/0.45	% ...of those cached                   : 21
0.10/0.45	% Propositional unsat checks           : 0
0.10/0.45	%    Propositional check models        : 0
0.10/0.45	%    Propositional check unsatisfiable : 0
0.10/0.45	%    Propositional clauses             : 0
0.10/0.45	%    Propositional clauses after purity: 0
0.10/0.45	%    Propositional unsat core size     : 0
0.10/0.45	%    Propositional preprocessing time  : 0.000
0.10/0.45	%    Propositional encoding time       : 0.000
0.10/0.45	%    Propositional solver time         : 0.000
0.10/0.45	%    Success case prop preproc time    : 0.000
0.10/0.45	%    Success case prop encoding time   : 0.000
0.10/0.45	%    Success case prop solver time     : 0.000
0.10/0.45	% Current number of processed clauses  : 13
0.10/0.45	%    Positive orientable unit clauses  : 9
0.10/0.45	%    Positive unorientable unit clauses: 0
0.10/0.45	%    Negative unit clauses             : 1
0.10/0.45	%    Non-unit-clauses                  : 3
0.10/0.45	% Current number of unprocessed clauses: 14
0.10/0.45	% ...number of literals in the above   : 22
0.10/0.45	% Current number of archived formulas  : 0
0.10/0.45	% Current number of archived clauses   : 5
0.10/0.45	% Clause-clause subsumption calls (NU) : 1
0.10/0.45	% Rec. Clause-clause subsumption calls : 1
0.10/0.45	% Non-unit clause-clause subsumptions  : 0
0.10/0.45	% Unit Clause-clause subsumption calls : 1
0.10/0.45	% Rewrite failures with RHS unbound    : 0
0.10/0.45	% BW rewrite match attempts            : 10
0.10/0.45	% BW rewrite match successes           : 4
0.10/0.45	% Condensation attempts                : 0
0.10/0.45	% Condensation successes               : 0
0.10/0.45	% Termbank termtop insertions          : 1772
0.10/0.45	% Search garbage collected termcells   : 265
0.10/0.45	
0.10/0.45	% -------------------------------------------------
0.10/0.45	% User time                : 0.004 s
0.10/0.45	% System time              : 0.003 s
0.10/0.45	% Total time               : 0.006 s
0.10/0.45	% Maximum resident set size: 3648 pages
0.10/0.45	
0.10/0.45	% -------------------------------------------------
0.10/0.45	% User time                : 0.006 s
0.10/0.45	% System time              : 0.006 s
0.10/0.45	% Total time               : 0.012 s
0.10/0.45	% Maximum resident set size: 4864 pages
0.10/0.45	% E exiting
0.10/0.45	EOF